The probability that a numerical analysis problem is difficult
نویسندگان
چکیده
منابع مشابه
The Probability That A Numerical Analysis Problem Is Difficult
Numerous problems in numerical analysis, including matrix inversion, eigenvalue calculations and polynomial zerofinding, share the following property: The difficulty of solving a given problem is large when the distance from that problem to the nearest "ill-posed" one is small. For example, the closer a matrix is to the set of noninvertible matrices, the larger its condition number with respect...
متن کاملThe probability that a small perturbation of a numerical analysis problem is difficult ∗
We prove a general theorem providing smoothed analysis estimates for conic condition numbers of problems of numerical analysis. Our probability estimates depend only on geometric invariants of the corresponding sets of ill-posed inputs. Several applications to linear and polynomial equation solving show that the estimates obtained in this way are easy to derive and quite accurate. The main theo...
متن کاملThe probability that a slightly perturbed numerical analysis problem is difficult
We prove a general theorem providing smoothed analysis estimates for conic condition numbers of problems of numerical analysis. Our probability estimates depend only on geometric invariants of the corresponding sets of ill-posed inputs. Several applications to linear and polynomial equation solving show that the estimates obtained in this way are easy to derive and quite accurate. The main theo...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA generalization of the probability that the commutator of two group elements is equal to a given element
The probability that the commutator of two group elements is equal to a given element has been introduced in literature few years ago. Several authors have investigated this notion with methods of the representation theory and with combinatorial techniques. Here we illustrate that a wider context may be considered and show some structural restrictions on the group.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1988
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1988-0929546-7